翻訳と辞書 Words near each other ・ Corn whiskey ・ Corn, Lot ・ Corn, Oklahoma ・ Corn-fed ・ Corn-free diet ・ Corna (disambiguation) ・ Corna (moth) ・ Corna Imagna ・ Corna Mara ・ Corna Trentapassi ・ Cornaa railway station ・ Cornac ・ Cornac, Lot ・ Cornacates ・ Cornacchia ・ Cornacchia's algorithm ・ Cornaceae ・ Cornada ・ Cornafean GAA ・ Cornafulla ・ Cornago ・ Cornal Hendricks ・ Cornalba ・ Cornald Maas ・ Cornale ・ Cornale e Bastida ・ Cornales ・ Cornalin d'Aoste ・ Cornallis ・ Cornallis gracilipes Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Cornacchia's algorithm ： ウィキペディア英語版 Cornacchia's algorithm In computational number theory, Cornacchia's algorithm is an algorithm for solving the Diophantine equation $x^2+dy^2=m$, where ==The algorithm== First, find any solution to $r\_0^2\backslash equiv-d\backslash pmod\; m$ (perhaps by using an algorithm listed here); if no such $r\_0$ exist, there can be no primitive solution to the original equation. Without loss of generality, we can assume that (if not, then replace with , which will still be a root of ). Then use the Euclidean algorithm to find $r\_1\backslash equiv\; m\backslash pmod$, $r\_2\backslash equiv\; r\_0\backslash pmod$ and so on; stop when . If $s=\backslash sqrt$ is an integer, then the solution is $x=r\_k,y=s$; otherwise there is no primitive solution. To find non-primitive solutions where , note that the existence of such a solution implies that divides (and equivalently, that if is square-free, then all solutions are primitive). Thus the above algorithm can be used to search for a primitive solution to . If such a solution is found, then will be a solution to the original equation. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Cornacchia's algorithm」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.